Using Layout Stitching to create Deterministic Local Graph Layouts
نویسندگان
چکیده
Dynamic graph layouts are often used to position nodes in local views of large graphs. These layouts can be optimized to minimize changes when navigating to other parts of the graph. Dynamic graph layout techniques do not, however, guarantee that a local layout is recognizable when the user visits the same area twice. In this paper we present a method to create stable and deterministic layouts of dynamic views of large graphs. It is based on a well-known panorama-stitching algorithm from the image processing domain. Given a set of overlapping photographs it creates a larger panorama that combines the original images. In analogy to that our algorithm stitches pre-computed layouts of subgraphs to form a larger, single layout. This deterministic approach makes structures and node locations persistent which creates identical visual representations of the graph. This enables the user to recognize previously encountered parts and to decide whether a certain part of a dataset has already been explored before or not.
منابع مشابه
Adaptive Surface Reconstruction for SPH using 3-Level Uniform Grids
Dynamic graph layouts are often used to position nodes in local views of large graphs. These layouts can be optimized to minimize changes when navigating to other parts of the graph. Dynamic graph layout techniques do not, however, guarantee that a local layout is recognizable when the user visits the same area twice. In this paper we present a method to create stable and deterministic layouts ...
متن کاملPuzzle Generators and Symmetric Puzzle Layout
We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modelled as puzzle graphs. Based on these models, we implement two puzzle generators and produce various layouts of the puzzles using graph drawing algorithms. Using these puzzle generators we can create new puzzles. Further, we can create new user interfaces of a puzzle by applying different layout ...
متن کاملThe Puzzle Layout Problem
We address the new problem of puzzle layout as a new application of graph drawing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled as puzzle graphs. Based on these models, we implement two puzzle generators and produce various layouts of the puzzles using graph drawing algorithms. Using these puzzle generators we can create new puzzles. Fu...
متن کاملSupporting management of sensor networks through interactive visual analysis
With the increasing capabilities of measurement devices and computing machines, the amount of recorded data grows rapidly. It is so high that manual processing is no longer feasible. The Visual Analytics approach is powerful because it combines the strengths of human recognition and vision system with today’s computing power. Different, but strongly linked visualizations and views provide uniqu...
متن کاملA Novel Methodology for Triple/Multiple-Patterning Layout Decomposition
Double patterning (DP) in a litho-etch-litho-etch (LELE) process is an attractive technique to scale the K1 factor below 0.25. For dense bidirectional layers such as the first metal layer (M1), however, density scaling with LELE suffers from poor tip-to-tip (T2T) and tip-to-side (T2S) spacing. As a result, triple-patterning (TP) in a LELELE process has emerged as a strong alternative. Because o...
متن کامل